Online Packet-Routing in Grids with Bounded Buffers

A General Approach to Dynamic Packet Routing with Bounded Buffers

Dynamic Packet Routing on Arrays with Bounded Buffers

A b s t r a c t . We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes. We give the first routing algorithm on this topology that is stable under an injection rate within a constant factor of the hardware bandwidth. Unlike previous results, our algorithm does not requir...

Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols

In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary networks. The protocol is analyzed in terms of the size of the network and the routing number of the network. Given a network H of size n, the routing number of H is defined as the maximum over all permutations on [n] of the minimal number of steps to route offline in H . We can show that for any n...

Better Online Deterministic Packet Routing on Grids

We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The goal of the routing algorithm is to maximize throughput, i.e., route as many packets as possible to their destination. Our main result is an O ...

Many - to - One Packet Routing on Grids

We study the general many-to-one packet routing problem in a grid-topology network, where the number of packets destined at a single node may be arbitrary (in contrast to the permutation and h h routing models), and the semantics of the packets is unknown (thus disallowing packet combining). The worst case time complexity of the problem may be very high, due to the possible existence of “hot sp...